Complete characterization of the minimal-ABC trees
نویسندگان
چکیده
The problem of complete characterization trees with minimal atom-bond-connectivity index (minimal-ABC trees) is a long-standing open problem. Here firstly, we give an affirmative answer to the conjecture, which states that enough large minimal-ABC are comprised solely root vertex and so-called Dz- Dz+1-branches. Based on presented theoretical results here some already known results, obtain constraints reduce search space solve optimization problem, thus, determine exactly given arbitrary order.
منابع مشابه
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns. Fowler and Kobourov [7] later proved that the set of patterns was incomplete and added two additional patterns. In this paper, we show that the characterization is still incomplete by providing new MLNP patterns not ...
متن کاملProving a Conjecture of Gutman Concerning Trees with Minimal ABC Index
The atom-bond connectivity (ABC) index of a graph ( , ) G V E is defined as ( ) [ ( ) ( ) 2] / [ ( ) ( )] uv E ABC G d u d v d u d v , where ( ) d u denotes the degree of vertex u of G . This recently introduced molecular structure descriptor found interesting applications in the study of the thermodynamic stability of acyclic saturated hydrocarbons, and the strain energy of their cyclic congen...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملMinimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties needed for planar trees to lock, with a focus on finding the smallest locked trees according to different measures of complexity, and suggests some new avenues of research for the problem of algorithmic characterizat...
متن کاملReconstructing Minimal Rooted Trees
For a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T . The running time of this algorithm is polynomial up to the number of trees with this property. This type of problem arises in several areas of classification, particularly evolutionary biology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2023
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2023.03.027